Proof mining in L1-approximation Ulrich Kohlenbach a,1, Paulo Oliva a,1 a Department of Computer Science, University of Aarhus, DK-8000 Aarhus C,

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical analysis
• Mathematics
• Operator theory
• Computability theory
• Approximation theory
• Fourier analysis
• Modulus of continuity
• Primitive recursive function
• Linear temporal logic
• Differential forms on a Riemann surface

Fachbereich Mathematik Proof mining and combinatorics Program extraction for Ramsey’s theorem for pairs Vom Fachbereich Mathematik

Source URL: tuprints.ulb.tu-darmstadt.de

• Mathematics
• Topology
• Mathematical analysis
• Computability theory
• General topology
• Proof theory
• Mathematical logic
• Reverse mathematics
• BolzanoWeierstrass theorem
• HeineBorel theorem
• Intermediate value theorem
• Primitive recursive function

Some computational aspects of metric fixed point theory Ulrich Kohlenbach Department of Mathematics Darmstadt University of Technology Schlossgartenstraße 7

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical analysis
• Operator theory
• Mathematics
• Computability theory
• Contraction
• Primitive recursive function
• Differential forms on a Riemann surface
• Distribution

BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the No-Counterexample Interpretation On the No-Counterexample Interpretation

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical logic
• Logic
• Proof theory
• Computability theory
• Mathematics
• Constructivism
• Primitive recursive functional
• First-order logic
• Symbol
• Primitive recursive function
• Primitive recursive arithmetic
• Realizability

The Church-Scott representation of inductive and coinductive data in (typed) λ calculus Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Computability theory
• Lambda calculus
• Recursion
• Theoretical computer science
• Type theory
• Combinatory logic
• Church encoding
• Initial algebra
• Primitive recursive function

Inductive and Coinductive Data Types in Typed Lambda Calculus Revisited Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Type theory
• Computability theory
• Functional programming
• Theoretical computer science
• Recursion
• Initial algebra
• Lambda calculus
• Primitive recursive function
• Inductive type
• Catamorphism
• F-algebra

A Lambda Calculus for Real Analysis Paul Taylor1 Andrej Bauer2 1 Department

Source URL: www.paultaylor.eu

• Theoretical computer science
• Theory of computation
• Functions and mappings
• Function
• Computable function
• Algorithm characterizations
• Primitive recursive function
• Mathematics
• Computability theory
• Mathematical logic

Recursive Session Types Revisited Ornela Dardha∗ School of Computing Science, University of Glasgow, UK Session types model structured communication-based programming. In particular, binary

Source URL: www.dcs.gla.ac.uk

• Computability theory
• Process calculi
• Π-calculus
• Theory of computation
• Function
• Valuation
• Logarithm
• Μ operator
• Primitive recursive function
• Mathematics
• Theoretical computer science
• Functions and mappings

Lowness Properties and Approximations of the Jump Santiago Figueira ∗

Source URL: www.glyc.dc.uba.ar

• Theoretical computer science
• Mathematical logic
• Theory of computation
• Recursion
• Primitive recursive function
• Function
• Μ operator
• Fixed-point combinator
• Mathematics
• Computability theory
• Functions and mappings

1995 Paper 4 Question 9 Computation Theory Explain what is meant by a primitive recursive function and by a partial recursive function. [6 marks]

Source URL: www.cl.cam.ac.uk